Convolutive Non-negative Matrix Factorisation with Sparseness Constraint
نویسندگان
چکیده
Discovering a parsimonious representation that reflects the structure of audio is a requirement of many machine learning and signal processing methods. Such a representation can be constructed by Non-negative Matrix Factorisation (NMF), which is a method for finding parts-based representations of non-negative data. We present an extension to NMF that is convolutive and forces a sparseness constraint. Combined with spectral magnitude analysis of audio, this method discovers auditory objects and their associated sparse activation patterns.
منابع مشابه
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can be constructed by Non-negative Matrix Factorisation (NMF), a method for finding parts-based representations of non-negative data. Here, we present an extension to convolutive NMF that includes a sparseness constraint, ...
متن کاملDiscovering Convolutive Speech Phones Using Sparseness and Non-negativity
Abstract Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can be constructed by Non-negative Matrix Factorisation (NMF). Here, we present a convolutive NMF algorithm that includes a sparseness constraint on the activations and has multiplicative updates. In combination w...
متن کاملDiscovering Convolutive Speech Phones using Sparseness and Non-Negativity Constraints
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can be constructed by Nonnegative Matrix Factorisation (NMF), which is a method for finding parts-based representations of non-negative data. Here, we present an extension to convolutive NMF that includes a sparseness cons...
متن کاملShifted 2D Non-negative Tensor Factorisation
Recently, Non-negative Matrix Factor 2D Deconvolution was developed as a means of separating harmonic instruments from single channel mixtures. This technique uses a model which is convolutive in both time and frequency, and so can capture instruments which have both time-varying spectra and timevarying fundamental frequencies simultaneously. However, in many cases two or more channels are avai...
متن کاملBandwidth expansion of narrowband speech using non-negative matrix factorization
In this paper, we present a novel technique for the estimation of the high frequency components (4-8kHz) of speech signals from narrow-band (0-4 kHz) signals using convolutive Non-Negative Matrix Factorisation (NMF). The proposed technique utilizes a brief recording of simultaneous broad band and narrow band signals from a target speaker to learn a set of broad-band non-negative "bases" for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006